ON THE MULTIPLICATIVE ORDER OF a MODULO n

نویسنده

  • Jonathan Chappelon
چکیده

Let n be a positive integer and αn be the arithmetic function which assigns the multiplicative order of an modulo n to every integer a coprime to n and vanishes elsewhere. Similarly, let βn assign the projective multiplicative order of a n modulo n to every integer a coprime to n and vanish elsewhere. In this paper, we present a study of these two arithmetic functions. In particular, we prove that for every positive integers n1 and n2 with the same square-free part, there exists an exact relationship between the functions αn1 and αn2 and between the functions βn1 and βn2 . This allows us to reduce the determination of αn and βn to the case where n is square-free. These arithmetic functions recently appeared in the context of an old problem of Molluzzo, and more precisely in the study of which arithmetic progressions yield a balanced Steinhaus triangle in Z/nZ for n odd.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Multiplicative Order of Fn+1/fn modulo Fm

Here, we show that if s �∈ {1, 2, 4} is a fixed positive integer and m and n are coprime positive integers such that the multiplicative order of Fn+1/Fn modulo Fm is s, where Fk is the kth Fibonacci number, then m < 500s2.

متن کامل

ON THE ORDER OF a MODULO n, ON AVERAGE

Let a > 1 be an integer. Denote by la(n) the multiplicative order of a modulo integer n ≥ 1. We prove that there is a positive constant δ such that if x1−δ = o(y), then 1 y ∑

متن کامل

On a Problem of Arnold: the Average Multiplicative Order of a given Integer Pär Kurlberg and Carl Pomerance

For g, n coprime integers, let `g(n) denote the multiplicative order of g modulo n. Motivated by a conjecture of Arnold, we study the average of `g(n) as n ≤ x ranges over integers coprime to g, and x tending to infinity. Assuming the Generalized Riemann Hypothesis, we show that this average is essentially as large as the average of the Carmichael lambda function. We also determine the asymptot...

متن کامل

On a Problem of Arnold: the Average Multiplicative Order of a given Integer

For g, n coprime integers, let `g(n) denote the multiplicative order of g modulo n. Motivated by a conjecture of Arnold, we study the average of `g(n) as n ≤ x ranges over integers coprime to g, and x tending to infinity. Assuming the Generalized Riemann Hypothesis, we show that this average is essentially as large as the average of the Carmichael lambda function. We also determine the asymptot...

متن کامل

Preliminary Version on the Order of Unimodular Matrices modulo Integers

Assuming the Generalized Riemann Hypothesis, we prove the following: If b is an integer greater than one, then the multiplicative order of b modulo N is larger than N for all N in a density one subset of the integers. If A is a hyperbolic unimodular matrix with integer coefficients, then the order of A modulo p is greater than p for all p in a density one subset of the primes. Moreover, the ord...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009